WEB系统中统计图绘制研究

简要介绍了GDI+,提出了在Web系统中利用GDI+实现统计图绘制的思路,并结合Visual C#.NET与Oracle数据库,举例阐述了统计图实现的关键技术和具体步骤,该技术在军队油库信息可视化研究与应用项目中得到很好应用。     

产品网络化协同开发系统信息处理模型研究

产品网络协同开发系统信息处理模型是现代制造企业从事产品开发、提高企业核心竞争力的关键。在分析产品网络化协同开发系统现状的基础上,阐明了产品网络化协同开发系统的基本内涵及实现方法。提出了基于输入、输出、知识、关系、方法和时间约束六个方面组成的产品网络化协同开发系统的信息处理统一模型;建立了一个面向产品开发全过程协同的信息流模型,构建了产品网络化协同开发平台信息流模型的软件结构,为制造企业建立产品网络协同开发平台,实现产品开发过程的信息化、科学化和规范化进行了有益的工作。     

自适应网格交互多模型算法

研究和设计了一种模型集合自适应方法——自适应网格方法。并将其与交互多模型算法相结合,提出了自适应网格交互多模型(AGIMM)算法,它是一种变结构多模型算法。仿真显示它能有效地提高IMM估计器的费效比。     

物元理论在优选对地打击目标中的应用

优选对地打击目标是现代信息化战争条件下联合作战对地火力协调中心在计划火力时的首要任务。旨在从目标的重要性、可靠性、射击紧迫性及对其射击时自身被发现的机会四个因素入手,举例证明如何构造物元模型,做到定性与定量相结合,对于编制炮兵C4I系统计划火力软件具有一定的参考价值。     

储油罐区灭火确定冷却兵力部署的模拟模型

本文提出了冷却燃烧罐和邻近罐时水枪应放置的位置的一系列数学描述原则,从而建立了油罐灭火冷却力量部署的模拟模型,该模型可方便地用于计算机模拟系统。     

一种性能驱动的时序规划方法

在超级计算机体系结构设计阶段 ,有必要进行时序规划 ,以尽早判断设计方案和性能指标的物理可实现性。提出一种性能驱动的时序规划方法 ,采用适于组件性能描述的时序性能模型 ,并按照线网权重分配路径延时余量 ,算法具有效率高、延时分配合理的优点     

Variables inspection for SPC‐quarantined production

When a control chart signals an out‐of‐control condition for a production process, it may be desirable to “quarantine” all units produced since the last in‐control SPC sample. This paper presents an efficient procedure for variables inspection of such “SPC quarantined” product. A Bayesian sequential inspection procedure is developed which determines whether the out of control production is of acceptable quality. By inspecting the units in reverse of the order in which they were produced, the procedure is also capable of detecting the point at which the process went out of control, thus eliminating the need to inspect units produced prior to the onset of the out of control condition. Numerical examples are presented, and the performance characteristics of the procedure are demonstrated using Monte Carlo simulation. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 159–171, 2001     

火控雷达的仿真目标建模及实现

中外军队的实践证明 :模拟训练是一种最简便、成本低、效果好的训练方式。对于需要空情保障和训练成本高的雷达训练来说更是如此。探讨了火控雷达回波信号的模型建立及实施方案。     

A single‐period inventory placement problem for a serial supply chain

This article addresses the inventory placement problem in a serial supply chain facing a stochastic demand for a single planning period. All customer demand is served from stage 1, where the product is stored in its final form. If the demand exceeds the supply at stage 1, then stage 1 is resupplied from stocks held at the upstream stages 2 through N, where the product may be stored in finished form or as raw materials or subassemblies. All stocking decisions are made before the demand occurs. The demand is nonnegative and continuous with a known probability distribution, and the purchasing, holding, shipping, processing, and shortage costs are proportional. There are no fixed costs. All unsatisfied demand is lost. The objective is to select the stock quantities that should be placed different stages so as to maximize the expected profit. Under reasonable cost assumptions, this leads to a convex constrained optimization problem. We characterize the properties of the optimal solution and propose an effective algorithm for its computation. For the case of normal demands, the calculations can be done on a spreadsheet. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:506–517, 2001     

An integer programming model for the weekly tour scheduling problem

We study a workforce planning and scheduling problem in which weekly tours of agents must be designed. Our motivation for this study comes from a call center application where agents serve customers in response to incoming phone calls. Similar to many other applications in the services industry, the demand for service in call centers varies significantly within a day and among days of the week. In our model, a weekly tour of an agent consists of five daily shifts and two days off, where daily shifts within a tour may be different from each other. The starting times of any two consecutive shifts, however, may not differ by more than a specified bound. Furthermore, a tour must also satisfy constraints regarding the days off, for example, it may be required that one of the days off is on a weekend day. The objective is to determine a collection of weekly tours that satisfy the demand for agents' services, while minimizing the total labor cost of the workforce. We describe an integer programming model where a weekly tour is obtained by combining seven daily shift scheduling models and days‐off constraints in a network flow framework. The model is flexible and can accommodate different daily models with varying levels of detail. It readily handles different days‐off rules and constraints regarding start time differentials in consecutive days. Computational results are also presented. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 607–624, 2001.